Sisyphus-VT: A CommonKADS solution
نویسندگان
چکیده
This article contains a CommonKADS description of the Sisyphus ’93 problem : the VT elevator design . The term ‘‘CommonKADS’’ is used to refer to KADS as it has been developed within ESPRIT project P5248 KADS-II . The goal of this project was to arrive at a de facto European standard for KBS development . As the term ‘‘KADS’’ has become strongly associated with the University of Amsterdam , it is worthwhile to point out that CommonKADS is the result of a cooperative ef fort of a number of partners , in particular also (in the context of this paper) the Free University of Brussels and the Netherlands Energy Research Centre ECN . A central theme of CommonKADS is the idea that various perspectives or models are important in the KBS development process : models of the organization , of the overall task , of the agents involved , of the required communication , of the expertise , and of the design of the final artifact . In this article the focus is on expertise modelling and its relation to design and implementation . An overview of CommonKADS can be found in Schreiber , Wielinga , de Hoog , Akkermans and Van de Velde (1994 b ) ; the textual and graphical notations used are described in Schreiber , Wielinga , Akkermans , Van de Velde and Anjewierden (1994a) . † In Section 2 a brief characterization is given of the VT data set and of the application task . Section 3 describes the structure of the VT domain knowledge in the form of two ontologies . In Section 4 a top-down description is given of tasks and inferences involved . The methods underlying this decomposition are characterized . System design and implementation are addressed in Section 5 . The process of using the VT domain theory within our application is discussed also in this context . Section 6 discusses the possible contributions of this paper , as well as its limitations . This article assumes that the reader is familiar with the VT data set and the associated ONTOLINGUA ontologies .
منابع مشابه
RE-Design KNOWLEDGE REPRESENTATION WITH DEKLARE A domain model oriented, industrial KA framework applied to VT
The paper this extended abstract describes presents the DEKLARE approach to modelling and representing Re-Design Knowledge in an industrial context. We furnish this description of DEKLARE with references to standard KA approaches such as CommonKADS [1] and to Sisyphus-II ́s VT [2] problem and solutions. We expect that a discussion of the DEKLARE approach during the workshop will be beneficial to...
متن کاملConstraint Satisfaction and Fixes: Revisiting Sisyphus Vt
This paper explores the solution of the VT Sisyphus II challenge using a Constraint Satisfaction Problem (CSP) paradigm and is an extension of the ExtrAKTor work presented at EKAW 2006. ExtrAKTor takes a Protégé KB describing a propose and-revise (PnR) problem, including both constraints & fixes. Subsequently, it extracts and transforms these components so that they are directly usable by the E...
متن کاملReusable ontologies, knowledge-acquisition tools, and performance systems: PROTÉGÉ-II solutions to Sisyphus-2
This paper describes how we applied the PROTÉGÉ-II architecture to build a knowledgebased system that configures elevators. The elevator-configuration task was solved originally with a system that employed the propose-and-revise problem-solving method (VT; Marcus, Stout & McDermott, 1988). A variant of this task, here named the Sisyphus-2 problem, is used by the knowledge-acquisition community ...
متن کاملConfiguration-Design Problem Solving
Configuration design is a form of design where a set of pre-defined components is given and an assembly of selected components is sought that satisfies a set of requirements and obeys a set of constraints [13,17]. Sometimes an optimality criterion may be given that defines an ordering upon possible solutions. A typical example of a configuration problem is the design of elevators from a set of ...
متن کاملAn Application of the Process Mechanism to a Room Allocation Problem Using the pCG Language
The Sisyphus-I initiative consists of a constraint satisfaction problem in which a group of people in a research environment must be allocated rooms. Numerous constraints are detailed by the problem description which together impose a partial ordering on any solution. A solution to Sisyphus-I is presented in order to illustrate pCG, a CG-oriented programming language which embodies Mineau's (19...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Hum.-Comput. Stud.
دوره 44 شماره
صفحات -
تاریخ انتشار 1996